We characterise the elements of the (maximum) idempotent generatedsubsemigroup of the Kauffman monoid in terms of combinatorial data associatedto certain normal forms. We also calculate the smallest size of a generatingset and idempotent generating set.
展开▼